package com.wp.leetCode;

/**
 * @author 王萍
 * @date 2018/3/7 0007
 */

/**
 * Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
 For example, given n = 3, a solution set is:
 [
 "((()))",
 "(()())",
 "(())()",
 "()(())",
 "()()()"
 ]
 */
public class GenerateParentheses {


}
